A Universal Pezaris Array Multiplier Generator for SRAM-Based FPGAs
نویسندگان
چکیده
A core operation in actual circuits, especially in digital signal processing algorithms, is multiplication. Often, the computational performance of a DSP system is limited by its multiplication performance [Pet95]. The implementation of multiplier modules into FPGAs is crucial in terms of area, speed and pin limitation. In many cases, even small multiplier modules will exceed the capacity of one FPGA. In traditional design flows, the RTL modules must then be converted to a flat CLB netlist and be partitioned into multiple FPGA chips. Since the partitioning step is mainly constrained by FPGA pin limitation, this often results in solutions with very low logic utilization [Fan96]. This becomes a key problem, especially in the case of logic emulation systems [But92], since each FPGA has to provide several IOs for debugging purposes. Note, that the application of such a prototyping system can be restricted either by its limited FPGA count or by high clock rate demands. Therefore, the optimization goal during implementation can be either minimum area or minimum delay. In this paper, a new approach to implement fast array multipliers of any word length in SRAM-based FPGAs is presented. The proposed method is based on a generic FPGA model and, therefore, suitable for most commercial FPGA devices. Taking the logical structure of the multiplier into account, technology mapping including adaptive structure generation as well as signal flow driven placement and automatic partitioning are efficiently performed yielding implementations of higher performance and better resource utilization as published before.
منابع مشابه
A Universal Module Generator for LUT-Based FPGAs
In this paper we present a new approach to direct mapping of arbitrary combinational RTL (Register Transfer Level) components onto SRAM-based FPGAs. This method consists of a core generator which implements multiplexors and multiplexor structures directly onto FPGAs. The implementation incorporates the mapping, the decomposition and placement of the whole module. The method is neither limited t...
متن کاملA Universal CLA Adder Generator for SRAM-Based FPGAs
In this paper we present an universal module generator for hierarchical carry lookahead adders of any word length which is suitable for most SRAM-based FPGA architectures. We introduce a generic model of SRAMbased FPGAs taking different configurations of the logic blocks into account. Considering the logical structure of CLA adders we efficiently perform technology mapping including an adaptive...
متن کاملTesting for the Programming Circuit of SRAM-Based FPGAs
The programming circuit of SRAM-based FPGAs consists of two shift registers, a control circuit and a configuration memory (SRAM) cell array. Because the configuration memory cell array can be easily tested by conventional test methods for RAMs, we focus on testing for the shift registers. We first derive test procedures for the shift registers, which can be done by using only the faculties of t...
متن کاملModelling Routing Delays in SRAM - based FPGAs
This paper presents an efficient technique for estimating the propagation delay of signals in SRAM-based FPGAs, by using an analytic model of MOS integrated circuits. The model provides a facility for experimenting to find the effect that different routing structures in SRAM-based FPGAs have on the speed-performance of implemented circuits. To illustrate the applicability of the technique, two ...
متن کامل